Queueing systems with a reserve service channel
نویسندگان
چکیده
منابع مشابه
Queueing Systems with a Removable Service Station
A single server queueing system 'With constant Poisson input is considered and the partiel elimination of the station's idle fraction is envisaged by intermittent close-do'Wn and setup. The rule pertaining to the dismantling and re-establishing of the service staticn-the management doctrine-is based on the instantaneous size of the queue, but these processes are assumed to consume time. Operati...
متن کاملMachine Repair Queueing System with with Non-Reliable Service Stations And Heterogeneous Service Discipline (RESEARCH NOTE)
This investigation deals with M/M/R/N machine repair problem with R non-reliable service stations which are subjected to unpredictable breakdown. 1here is provision of an additional server to reduce backlog in the case of heavy load of failed machines. 1he permanent service stations repair the failed machines at an identical rate m and switch to faster repair rate when all service stations are ...
متن کاملFuzzy service control of queueing systems
We consider queueing systems in which the service rate is the controlled variable. The cost depends on the queue length and selected rate. The objective is to choose the service rate dynamically, based on the state of the system so as to minimize the average cost over an infinite horizon. Six classes, either known in the literature or new, are studied in detail: queueing systems with vacations,...
متن کاملStability of Parallel Queueing Systems with Coupled Service Rates
This paper considers a parallel system of queues fed by independent arrival streams, where the service rate of each queue depends on the number of customers in all of the queues. Necessary and sufficient conditions for the stability of the system are derived, based on stochastic monotonicity and marginal drift properties of multiclass birth and death processes. These conditions yield a sharp ch...
متن کاملConcavity of Queueing Systems with Nbu Service Times
This paper establishes structural properties of the throughput of a large class of queueing networks with i.i.d. new-better-than-used service times. The main result obtained in this paper is applied to a wide range of networks including tandems, cycles and fork-join networks with general blocking and starvation as well as certain networks with splitting-merging of traac streams, to deduce conca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicationes Mathematicae
سال: 1970
ISSN: 1233-7234,1730-6280
DOI: 10.4064/am-11-4-439-449